Constructing uniform central graphs and embedding into them
نویسندگان
چکیده
منابع مشابه
Embedding Graphs into Embedded Graphs
A drawing of a graph G in the plane is weakly simple if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph G in the plane is weakly simple, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class. In other words, we show that c-planarity with pipes is tractab...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملEmbedding Cartesian Products of Graphs into De Bruijn Graphs Embedding Cartesian Products of Graphs into De Bruijn Graphs
(m 2) of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), we investigate whether or not there exists a spanning subgraph of D which is isomorphic to G. We show that G is never a spanning subgraph of D when n is greater than three or when n equals three and m is greater than two. For n = 3 and m = 2, we can show for wide classes of graphs that G cannot be...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملEmbedding Bounded Bandwidth Graphs into l1
We introduce the first embedding of graphs of low bandwidth into `1, with distortion depending only upon the bandwidth. We extend this result to a new graph parameter called tree-bandwidth, which is very similar to (but more restrictive than) treewidth. This represents the first constant distortion embedding of a non-planar class of graphs into `1. Our results make use of a new technique that w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Pure and Applied Mathematics
سال: 2019
ISSN: 0019-5588,0975-7465
DOI: 10.1007/s13226-019-0337-4